Polynomial acceleration of iterative schemes associated with subproper splittings
نویسندگان
چکیده
منابع مشابه
On the convergence of subproper (multi)-splitting methods for solving rectangular linear systems
We give a convergence criterion for stationary iterative schemes based on subproper splittings for solving rectangular systems and show that, for special splittings, convergence and quotient convergence are equivalent. We also analyze the convergence of multisplitting algorithms for the solution of rectangular systems when the coefficient matrices have special properties and the linear systems ...
متن کاملGPU Acceleration of Iterative Clustering
Iterative clustering algorithms based on Lloyds algorithm (often referred to as the k-means algorithm) have been used in a wide variety of areas, including graphics, computer vision, signal processing, compression, and computational geometry. We describe a method for accelerating many variants of iterative clustering by using programmable graphics hardware to perform the most computationally ex...
متن کاملAssociation Schemes with Multiple Q-polynomial Structures
It is well known that an association scheme X = (X, {Ri}0≤i≤d) with k1 > 2 has at most two P polynomial structures. The parametrical condition for an association scheme to have twoP -polynomial structures is also known. In this paper, we give a similar result for Q-polynomial association schemes. In fact, if d > 5, then we obtain exactly the same parametrical conditions for the dual intersectio...
متن کاملPolynomial-Time Approximation Schemes
Let Π be an NP-hard optimization problem, and let A be an approximation algorithm for Π. For an instance I of Π, let A(I) denote the objective value when running A on I, and let OPT (I) denote the optimal objective value. The approximation ratio of A for the instance I is RA(I) = A(I)/OPT (I), thus, when Π is minimization (maximization) problem RA(I) ≥ 1 (RA(I) ≤ 1). A polynomial time approxima...
متن کاملPolynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1988
ISSN: 0377-0427
DOI: 10.1016/0377-0427(88)90350-0